Recursive coloration of countable graphs
نویسندگان
چکیده
منابع مشابه
Countable homogeneous multipartite graphs
We give a classification of all the countable homogeneous multipartite graphs. This generalizes the similar result for bipartite graphs given in [5]. 2010 Mathematics Subject Classification 05C99 keywords: multipartite graph, homogeneous, classification
متن کاملCountable connected-homogeneous graphs
A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the countably infinite connectedhomogeneous graphs. We prove that if Γ is connected countably infinite and connected-homogeneous then Γ is isomorphic to one of: Lachlan and Woodrow’s ultrahomogeneous graphs; the generic bipartite graph...
متن کاملMenger's theorem for countable graphs
For a finite graph G= (I’, E) Menger’s Theorem [6] states the following: if A, B c V then the minimal size of an A -B separating set of vertices (i.e., a set whose removal disconnects A from B), equals the maximal size of a set of disjoint A -B paths. This version of the theorem remains true, and quite easy to prove, also in the infinite case. To see this, take 9 to be a maximal (with respect t...
متن کاملEdge-Ends in Countable Graphs
The notion of ends equivalence classes on the set of rays (one-way infinite paths) of a graph is one of the most studied topics in infinite graph theory. An introduction to this theory and basic results can be found in Halin [3]. Halin defined two rays to be equivalent if no finite set of vertices can separate an infinite part of the first ray from an infinite part of the second one. In particu...
متن کاملThe Countable Character of Uncountable Graphs
We show that a graph can always be decomposed into edge-disjoint subgraphs of countable cardinality in which the edge-connectivities and edge-separations of the original graph are preserved up to countable cardinals. We also show that the vertex set of any graph can be endowed with a well-ordering which has a certain compactness property with respect to edge-separation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1983
ISSN: 0168-0072
DOI: 10.1016/0168-0072(83)90052-0